Cross‐comparison of convergence algorithms to solve trip‐based dynamic traffic assignment problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving the Convergence of Simulation-based Dynamic Traffic Assignment Methodologies

The ability of simulation-based dynamic traffic assignment (SBDTA) models to produce reliable solutions is crucial for practical applications, particularly for those involving the comparison of modeling results across multiple scenarios. This work reviews, implements and compares novel and existing techniques for finding equilibrium solutions for SBDTA problems, focusing on their convergence pa...

متن کامل

a model to solve project scheduling and staff assignment problems

the allocation of human resources to project activities in order to schedule them is one of the closest states to the actual conditions of scheduling problems. but regarding the fact that this problem belongs to the class of np-hard problems; so far the exact methods have only been able to solve the small size problems. in this study, the renewable resources are humans in a way that every staff...

متن کامل

Literature Review of Traffic Assignment: Static and Dynamic

Rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. In the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. With traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. Four s...

متن کامل

A Similarity-based Cellular Selection Mechanisim for Genetic algorithms to Solve Assignment Problems

In this paper, we illustrate a cellular structure mixed with Genetic Algorithms for solving assignment problems which have more than one feasible or optimum solution. Considering similarity among individuals in population, we use two dimensions Cellular Automata in order to place the individuals onto its cells to make the locality and neighborhood on Hamming distance basis. This new structure a...

متن کامل

Using Qualitative Reasoning to Solve Dynamic Problems

A significant amount of research has been done in solving static engineering problems. Dynamic problems, where at least one of the parameters of the system is changing, pose a larger challenge that has only been addressed in part by previous work. We describe two new qualitative reasoning techniques that we use to solve additional problems. In the first technique, we use qualitative reasoning t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer-Aided Civil and Infrastructure Engineering

سال: 2020

ISSN: 1093-9687,1467-8667

DOI: 10.1111/mice.12524